Normal edge‐colorings of cubic graphs
نویسندگان
چکیده
منابع مشابه
Line-graphs of cubic graphs are normal
A graph is called normal if its vertex set can be covered by cliques Q1, Q2, . . . , Qk and also by stable sets S1, S2, . . . , Sl, such that Si ∩ Qj 6= ∅ for every i, j. This notion is due to Körner, who introduced the class of normal graphs as an extension of the class of perfect graphs. Normality has also relevance in information theory. Here we prove, that the line graphs of cubic graphs ar...
متن کاملOn normal odd partitions in cubic graphs
A normal partition of the edges of a cubic graph is a partition into trails (no repeated edge) such that each vertex is the end vertex of exactly one trail of the partition. We investigate this notion and give some results and problems.
متن کاملOn normal partitions in cubic graphs
A normal partition of the edges of a cubic graph is a partition into trails (no repeated edge) such that each vertex is the end vertex of exactly one trail of the partition. We investigate this notion and give some results and problems.
متن کاملTotal domination in cubic Knodel graphs
A subset D of vertices of a graph G is a dominating set if for each u ∈ V (G) \ D, u is adjacent to somevertex v ∈ D. The domination number, γ(G) ofG, is the minimum cardinality of a dominating set of G. A setD ⊆ V (G) is a total dominating set if for eachu ∈ V (G), u is adjacent to some vertex v ∈ D. Thetotal domination number, γt (G) of G, is theminimum cardinality of a total dominating set o...
متن کاملOn Compatible Normal Odd Partitions in Cubic Graphs
A normal odd partition T of the edges of a cubic graph is a partition into trails of odd length (no repeated edge) such that each vertex is the end vertex of exactly one trail of the partition and internal in some trail. For each vertex v, we can distinguish the edge for which this vertex is pending. Three normal odd partitions are compatible whenever these distinguished edges are distinct for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Theory
سال: 2019
ISSN: 0364-9024,1097-0118
DOI: 10.1002/jgt.22507